Algebraic Semantics Based Behavioural Views of Configuration Relocation in Reconfigurable Computing
نویسندگان
چکیده
The square cells specified by Ruby language, called Ruby cells, can be relocated by either rotation, horizontal flip, vertical flip or shifting in a regular array structure such as FPGA (Field Programmable Gate Array) or Cell Matrix . In this paper, the behaviours of those relocations have shown at two different levels, called architectural level and logic level. In other words, the behavioural views describe the function of the configuration relocation of the target circuits regardless of its implementation. Under the behavioural view of configuration relocation at architectural level, the cell relocations can be specified and reasoned formally by algebraic laws of Ruby algebra and Group theory to create an abstract description of the configuration relocations of the target circuit without reference to particular elements within the reconfiguration device. Under the behavioural view of configuration relocation at logic level, the above abstract description considered as a Partial Order-based Model (POM) and its dependencies are given by the transition relation and this is our approach to synthesise the algorithm for reconfiguration micro-controller automatically the information contained in the high-level specification languages. 1. Motivation To implement a particular target circuit, reconfigurable devices require some type of configuration information, which describes how their internal elements should be configured. However, if this configuration information rigidly maps particular device elements to particular pieces of the target circuit, then the configuration will fail if those device elements have been damaged or occupied. Therefore, in order to implement a target circuit, one must avoid overly explicit configuration information. This can be achieved by describing the target circuit more abstractly, in terms of circuit building blocks and connections among those blocks. This abstract description is then used as a guide to configure the device, in order to implement the target circuit. More specifically, the strategy for creating target circuits comprises the following steps: 1. Create an abstract description of the target circuit, without reference to particular elements within the reconfigurable device; 2. Analyse the hardware of reconfigurable device, noting the locations of damaged/ occupied areas; and 3. Configure the device to implement the target circuit, based on the abstract circuit description, while avoiding the damaged/occupied device regions identified in step 2.
منابع مشابه
Algebraic Semantics of Configuration Relocation in Reconfigurable Computing
The square cells specified by Ruby language, called Ruby cells, can be relocated by either rotation, horizontal flip, vertical flip or shifting in a regular array structure such as FPGA (Field Programmable Gate Array) fabric. In this paper, our research has shown that those relocating cells can be specified and reasoned formally by algebraic laws of Ruby algebra and Group theory. As a result, a...
متن کاملConfiguration Prefetching Techniques for Partial Reconfigurable Coprocessors with Relocation and Defragmentation
One of the major overheads for reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedup possible in this paradigm. In this paper we explore configuration prefetching techniques for reducing this overhead. By overlapping the configuration loadings with the computation on the host processor the reconfiguration overhead can be reduced...
متن کاملAbstract : Configuration Relocation and Defragmentation for Reconfigurable Computing
Configuration Relocation and Defragmentation for Reconfigurable Computing 1 The complete paper is available at http://www.ece.nwu.edu/~kati/publications.html Katherine Compton, James Cooley, Stephen Knol Department of Electrical and Computer Engineering Northwestern University Evanston, IL USA [email protected] Scott Hauck Department of Electrical Engineering University of Washington Seattle, WA...
متن کاملFormalising Configuration Relocation Behaviours for Reconfigurable Computing
Although the partially reconfigurable FPGA design is powerful if two different configurations were mapped at compile time to overlapping locations in the FPGA, only one of these configurations can be present in the array at any given moment. They cannot operate simultaneously. However, if somehow the final FPGA location can be determined at runtime, one or both of these overlapping configuratio...
متن کاملProgramming Architectures For Run-Time Reconfigurable Systems
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the compute-intensive sections of an application to reconfigurable hardware, custom computing systems exhibit significant speedups over traditional microprocessors. However, the number and frequency of these hardware-mapped sections of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003